#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 7;
int n;
pair<int, int> p[N];
int main() {
cin>>n;
for(int i = 1; i <= n; i++) {
int l, r;
cin>>l>>r;
p[i] = {r, l};
}
sort(p + 1, p + 1 + n);
int cnt = p[1].first;
int ans = 1;
for(int i = 2; i <= n; i++) {
if(p[i].second > cnt) {
cnt = p[i].first;
ans ++;
}
}
cout << ans << '\n';
}/*1691312853.0849724*/
1516A - Tit for Tat | 622. Design Circular Queue |
814. Binary Tree Pruning | 791. Custom Sort String |
787. Cheapest Flights Within K Stops | 779. K-th Symbol in Grammar |
701. Insert into a Binary Search Tree | 429. N-ary Tree Level Order Traversal |
739. Daily Temperatures | 647. Palindromic Substrings |
583. Delete Operation for Two Strings | 518. Coin Change 2 |
516. Longest Palindromic Subsequence | 468. Validate IP Address |
450. Delete Node in a BST | 445. Add Two Numbers II |
442. Find All Duplicates in an Array | 437. Path Sum III |
436. Find Right Interval | 435. Non-overlapping Intervals |
406. Queue Reconstruction by Height | 380. Insert Delete GetRandom O(1) |
332. Reconstruct Itinerary | 368. Largest Divisible Subset |
377. Combination Sum IV | 322. Coin Change |
307. Range Sum Query - Mutable | 287. Find the Duplicate Number |
279. Perfect Squares | 275. H-Index II |